Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs
نویسندگان
چکیده
منابع مشابه
Improved infeasible-interior-point algorithm for linear complementarity problems
We present a modified version of the infeasible-interior- We present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by Mansouri et al. (Nonlinear Anal. Real World Appl. 12(2011) 545--561). Each main step of the algorithm consists of a feasibility step and several centering steps. We use a different feasibility step, which tar...
متن کاملA projection algorithm for strictly monotone linear complementarity problems
Complementary problems play a central role in equilibrium finding, physical simulation, and optimization. As a consequence, we are interested in understanding how to solve these problems quickly, and this often involves approximation. In this paper we present a method for approximately solving strictly monotone linear complementarity problems with a Galerkin approximation. We also give bounds f...
متن کاملA multisplitting method for symmetric linear complementarity problems
Over the years, many methods for solving the linear complementarity problem (LCP) have been developed. Most of these methods have their origin in solving a system of linear equations. In particular, much attention has recently been paid on the class of iterative methods called the splitting method, which is an extension of the matrix splitting method for solving a system of linear equations suc...
متن کاملOn linear programs with linear complementarity constraints
The paper is a manifestation of the fundamental importance of the linear program with linear complementarity constraints (LPCC) in disjunctive and hierarchical programming as well as in some novel paradigms of mathematical programming. In addition to providing a unified framework for bilevel and inverse linear optimization, nonconvex piecewise linear programming, indefinite quadratic programs, ...
متن کاملMatrix Linear Complementarity Problems
We consider the expected residual minimization formulation of the stochastic R0 matrix linear complementarity problem. We show that the involved matrix being a stochastic R0 matrix is a necessary and sufficient condition for the solution set of the expected residual minimization problem to be nonempty and bounded. Moreover, local and global error bounds are given for the stochastic R0 matrix li...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 1988
ISSN: 0254-5330,1572-9338
DOI: 10.1007/bf02186473